A generalized hypergreedy algorithm for weighted perfect matching
نویسندگان
چکیده
منابع مشابه
Using Generalized Language Model for Question Matching
Question and answering service is one of the popular services in the World Wide Web. The main goal of these services is to finding the best answer for user's input question as quick as possible. In order to achieve this aim, most of these use new techniques foe question matching. . We have a lot of question and answering services in Persian web, so it seems that developing a question matching m...
متن کاملA Note on Matchings Constructed during Edmonds' Weighted Perfect Matching Algorithm
We reprove that all the matchings constructed during Edmonds’ weighted perfect matching algorithm are optimal among those of the same cardinality (provided that certain mild restrictions are obeyed on the choices the algorithm makes). We conclude that in order to solve a weighted matching problem it is not needed to solve a weighted perfect matching problem in an auxiliary graph of doubled size...
متن کاملFast and Simple Algorithms for Weighted Perfect Matching
We present two fast and simple combinatorial approximation algorithms for constructing a minimum-weighted perfect matching on complete graphs whose cost functions satisfy the triangle inequality. The first algorithm runs in O(n log n) time and is at most a factor logn worse than an optimal solution. In the second algorithm, the average time until a node is matched is O(n) and the approximation ...
متن کاملAn algorithm for weighted fractional matroid matching
LetM be a matroid on ground set E. A subset l ⊆ E is called a line when r(l) ∈ {1, 2}. Given a set of lines L = {l1, . . . , lk} in M , a vector x ∈ RL+ is called a fractional matching when ∑ l∈L xla(F )l ≤ r(F ) for every flat F ofM . Here a(F )l is equal to 0 when l∩F = ∅, equal to 2 when l ⊆ F and equal to 1 otherwise. We refer to ∑ l∈L xl as the size of x. It was shown by Chang et al. that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BIT
سال: 1993
ISSN: 0006-3835,1572-9125
DOI: 10.1007/bf01989743